A globalized Newton method for the computation of normalized Nash equilibria
نویسندگان
چکیده
The generalized Nash equilibrium is a Nash game, where not only the players’ cost functions, but also the constraints of a player depend on the rival players decisions. We present a globally convergent algorithm that is suited for the computation of a normalized Nash equilibrium in the generalized Nash game with jointly convex constraints. The main tool is the regularized Nikaido-Isoda function as a basis for a locally convergent nonsmooth Newton method and, in another way, for the definition of a merit function for globalization. We conclude with some numerical results.
منابع مشابه
Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
We consider the generalized Nash equilibrium problem (GNEP), where not only the players’ cost functions but also their strategy spaces depend on the rivals’ decision variables. Existence results for GNEPs are typically shown by using a fixed point argument for a certain set-valued function. Here we use a regularization of this set-valued function in order to obtain a single-valued function that...
متن کاملGlobal Newton Method for stochastic games
The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equilibria of stochastic games. GLOBAL NEWTON METHOD FOR STOCHASTIC GAMES SRIHARI GOVINDAN AND ROBERT WILSON Abstract. The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equi...
متن کاملA global Newton method to compute Nash equilibria
A new algorithm is presented for computing Nash equilibria of ̄nite games. Using Kohlberg and Mertens' structure theorem we show that a homotopy method can be represented as a dynamical system and implemented by Smale's global Newton method. The algorithm is outlined and computational experience is reported. JEL Classi ̄cation C63.
متن کاملPerformance Profiles of Line-search Algorithms for Unconstrained Optimization
The most important line-search algorithms for solving large-scale unconstrained optimization problems we consider in this paper are the quasi-Newton methods, truncated Newton and conjugate gradient. These methods proved to be efficient, robust and relatively inexpensive in term of computation. In this paper we compare the Dolan-Moré [11] performance profile of line-search algorithms implemented...
متن کاملFormulation and Numerical Solution of Nash Equilibrium Multiobjective Elliptic Control Problems
The formulation and the semismooth Newton solution of Nash equilibria multiobjective elliptic optimal control problems are presented. Existence and uniqueness of a Nash equilibrium is proved. The corresponding solution is characterized by an optimality system that is approximated by second-order finite differences and solved with a semismooth Newton scheme. It is demonstrated that the numerical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Global Optimization
دوره 56 شماره
صفحات -
تاریخ انتشار 2013